A Note on Logical Connectives with Weak Duality

نویسندگان

  • Claudi Alsina
  • M. Santos Tomás
چکیده

We study the weak duality S(x, N (x)) = N (T (x, N (x))) where S is a continuous t-conorm, T is a continuous t-norm and N is a strong negation. We characterize completely the strict cases and show that in all other cases there is no direct relation between generators of T and S or between their possible Archimedean components in ordinal sums.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on symmetric duality in vector optimization problems

In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".

متن کامل

Because and although: a case of duality?

König (1989) argues that there is a relation of duality between concessive and causal constructions. Therefore, he maintains, any account of the meaning of causal connectives like because, via duality, also provides an account of the meaning of concessive connectives such as although. This paper lists a number of problems with König's account. Appealing to notions central to relevance theory, i...

متن کامل

A generalization of the Chen-Wu duality into quantale-valued setting

With the unit interval [0,1] as the truth value table, Chen and Wupresented the concept of  possibility computation over dcpos.Indeed, every possibility computation can be considered as a[0,1]-valued Scott open set on a dcpo. The aim of this paper is tostudy Chen-Wu's duality on quantale-valued setting. For clarity,with a commutative unital quantale $L$ as the truth value table, weintroduce a c...

متن کامل

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

A duality between LM-fuzzy possibility computations and their logical semantics

Let X be a dcpo and let L be a complete lattice. The family σL(X) of all Scott continuous mappings from X to L is a complete lattice under pointwise order, we call it the L-fuzzy Scott structure on X. Let E be a dcpo. A mapping g : σL(E) −> M is called an LM-fuzzy possibility valuation of E if it preserves arbitrary unions. Denote by πLM(E) the set of all LM-fuzzy possibility valuations of E. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015